#include"BSTree.h"
#define key int
#define val int

using sbtree = BSTree<key, val>;

void testtree01()
{
	sbtree tree01({12,12});
	for (int i = 0; i < 12; i++)
	{
		tree01.insert({ i,i });
	}

	tree01.inorder();
	sbtree tree02;
	tree02.inorder();
}

void testtree02()
{
	sbtree tree;
	int arr[7] = { 5,4,6,3,2,7,1 };
	for (auto num : arr)
		tree.insert({ num , num });
	for (auto num : arr)
	{
		tree.inorder();
		tree.erase(num);
	}

}



int main()
{
	//testtree01();
	testtree02();
	return 0;
}